Completely unimodal numberings of a simple polytope
نویسندگان
چکیده
منابع مشابه
On Completely Simple Semigroups
In this paper completely simple semigroups or generalized groups are considered. We characterize generalized groups which are normal generalized groups. Homomorphisms of generalized groups are considered. Equivalent conditions for the kernel of a homomorphism are deduced. We prove that the group components of a generalized group have the same cardinality. We also prove that if G is a finite nor...
متن کاملGödel Numberings versus Friedberg Numberings
In [3], Rogers discussed the concept of Gödel numbering. He defined a semi-effective numbering, constructed a semi-lattice of equivalence classes of semi-effective numberings, and showed that all Gödel numberings belong to the unique maximal element of this semi-lattice. In [l], Friedberg gave a recursive enumeration without repetition of the set of partial recursive functions of a single varia...
متن کاملOn the k-Systems of a Simple Polytope
A k-system of the graph GP of a simple polytope P is a set of induced subgraphs of GP that shares certain properties with the set of subgraphs induced by the k-faces of P . This new concept leads to polynomial-size certificates in terms of GP for both the set of vertex sets of facets as well as for abstract objective functions (AOF) in the sense of Kalai. Moreover, it is proved that an acyclic ...
متن کاملThe Number of k -Faces of a Simple d -Polytope
Consider the question: Given integers k < d < n, does there exist a simple d-polytope with n faces of dimension k? We show that there exist numbers G(d; k) and N (d; k) such that for n > N (d; k) the answer is yes if and only if G(d; k) divides n. Furthermore, a formula for G(d; k) is given, showing that e.g. G(d; k) = 1 if k d+1 2 or if both d and k are even, and also in some other cases (mean...
متن کاملGenerating Sets of Completely 0-simple Semigroups
A formula for the rank of an arbitrary finite completely 0-simple semigroup, represented as a Rees matrix semigroup M[G; I,Λ;P ] , is given. The result generalises that of Ruškuc concerning the rank of connected finite completely 0-simple semigroups. The rank is expressed in terms of |I| , |Λ| , the number of connected components k of P and a number rmin which we define. We go on to show that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90042-x